-
1 n-arna struktura
См. также в других словарях:
Structure (mathematical logic) — In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it. Universal algebra studies structures that generalize the algebraic structures such as… … Wikipedia
Structure Mapping Engine — In artificial intelligence and cognitive science, the structure mapping engine is an implementation in software of an algorithm for analogical matching based on the psychological theory of Dedre Gentner [1983] . The basis of Gentner s structure… … Wikipedia
d-ary heap — The d ary heap or d heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2.[1][2][3] Thus, a binary heap is a 2 heap. According to Tarjan[2] and Jensen et al … Wikipedia
Interpretable structure — In model theory, a structure N is called interpretable in M if all the components (universe, functions, relations etc.) of N can be defined in terms of the components of M . In particular, the universe of N is represented as a definable subset of … Wikipedia
Algebraic structure — In algebra, a branch of pure mathematics, an algebraic structure consists of one or more sets closed under one or more operations, satisfying some axioms. Abstract algebra is primarily the study of algebraic structures and their properties. The… … Wikipedia
Secondary structure prediction — is a set of techniques in bioinformatics that aim to predict the local secondary structures of proteins and RNA sequences based only on knowledge of their primary structure amino acid or nucleotide sequence, respectively. For proteins, a… … Wikipedia
D-ary heap — The d ary heap or d heap is a generalization of the binary heap data structure whose non leaf nodes have d children, instead of 2.According to Jensen et al. [cite journal |title=An extended truth about heaps |author=Jensen |coauthors=Katajainen;… … Wikipedia
Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap … Wikipedia
aviary — aviarist /ay vee euh rist/, n. /ay vee er ee/, n., pl. aviaries. a large cage or a house or enclosure in which birds are kept. [1570 80; < L aviarium a place where birds are kept, n. use of neut. of aviarius pertaining to birds. See AVI , ARY] *… … Universalium
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
